On Binary Search Tree Recursions with Monomials as Toll Functions
نویسنده
چکیده
We consider distributional recursions which appear in the study of random binary search trees with monomials as toll functions. This extends classical parameters as the internal path length in binary search trees. As our main results we derive asymptotic expansions for the moments of the random variables under consideration as well as limit laws and properties of the densities of the limit distributions. The analysis is based on the contraction method. AMS subject classifications. Primary: 60F05; secondary: 60E05, 60E10.
منابع مشابه
Connecting Yule Process, Bisection and Binary Search Tree via Martingales
We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.
متن کاملA Novel Anti-collision Backtracking Algorithm Based on Binary-tree Search in UHF
To anti-collision problem of multiple tags of RFID in ETC (Electronic Toll Collection) system, a novel BBS (Backtracking Binary-tree Search ) anti-collision algorithm is proposed in working in UHF (5.8G) based on the DBS (Dynamic Binary-tree Search) and RSBS (Random Split Binary-tree Search) to solve the only one bit collision in inquiry. The BBS algorithm can reduce twice inquiry process. The ...
متن کاملCentral Limit Theorems for Additive Tree Parameters
We call a tree parameter additive if it can be determined recursively as the sum of the parameter values of all branches, plus a certain toll function. In this paper, we prove central limit theorems for very general toll functions, provided that they are bounded and small on average. Simply generated families of trees are considered as well as Pólya trees, recursive trees and binary search tree...
متن کاملMixed Poisson approximation of node depth distributions in random binary search trees
We investigate the distribution of the depth of a node containing a specific key or, equivalently, the number of steps needed to retrieve an item stored in a randomly grown binary search tree. Using a representation in terms of mixed and compounded standard distributions, we derive approximations by Poisson and mixed Poisson distributions; these lead to asymptotic normality results. We are part...
متن کاملSequential Optimization of Binary Search Trees for Multiple Cost Functions
In this paper, we present a methodology to model the optimal binary search tree problem as a directed acyclic graph to extract all possible optimal solutions. We provide a mechanism to find optimal binary search trees relative to different types of cost functions, sequentially. We prove that for a set of n keys our optimization procedure makes O(n) arithmetic operations per cost function such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001